Woven Turbo Codes

نویسندگان

  • J. Freudenberger
  • M. Bossert
چکیده

A new code construction namely woven turbo codes, is presented , which is a variation of woven convolutional codes. Parallel encoders (turbo codes 2]) can be considered as a special case of woven turbo encoders, where only one outer and inner encoder is used. However, woven turbo codes with a larger number of outer codes yield higher minimum distances than turbo codes with random permutations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Woven codes with outer warp: variations, design, and distance properties

In this paper we consider convolutional and block encoding schemes which are variations of woven codes with outer warp. We propose methods to evaluate the distance characteristics of the considered codes on the basis of the active distances of the component codes. With this analytical bounding technique, we derived lower bounds on the minimum (or free) distance of woven convolutional codes, wov...

متن کامل

An approach to fault detection and correction in design of systems using of Turbo ‎codes‎

We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...

متن کامل

Woven Codes with Outer Block Codes

Woven codes with outer binary block codes and additional permutation are presented. This enables the construction of a new class of woven block codes, where the minimum distance is about twice the product of the minimum distances of the component codes.

متن کامل

Woven convolutional graph codes with large free distances

Constructions of woven graph codes based on constituent convolutional codes are studied, and examples of woven convolutional graph codes are presented. Existence of codes satisfying the Costello lower bound on the free distance within a random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs is shown, where s depends only on the code rate. Simulation results for Viterbi d...

متن کامل

A Very General Family of Turbo-Codes: The Multi-Non- Binary Turbo-Codes

1 Facultatea de Electronică şi Telecomunicaţii, Departamentul Comunicaţii, Bd. V. Pârvan Nr. 2, 300223 Timişoara, e-mail [email protected], [email protected], [email protected] 2 Department of Electrical and Computer Eingineering, Rice University, MS-366 – 6100 Main Street, Huston, Texas 77005, e-mail [email protected] Universitatea Politehnica din Bucuresti, Facultatea de Elec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000